Constraint-based Hierarchical Placement of Parallel Programs
نویسندگان
چکیده
This paper continues our investigation into the feasibility of exploiting the structure of a parallel program to guide its hardware implementation. We review previous work, and present our new approach to the problem based upon placing netlists hierarchically. It is found that appropriate constraints can be derived from the source code in a straight-forward way, and this information can be used to guide the subsequent placement routines. Comparisons with traditional placement procedures based on simulated annealing are given.
منابع مشابه
Resource-Based Communication Placement Analysis
Communication placement analysis is an important step in the compilation of data-parallel programs. However, to simplify the placement analysis, previous techniques ignored most machine-dependent resource constraints. This paper demonstrates the necessity of incorporating resource constraints in ensuring the correctness of the communication placement. It presents a new placement analysis techni...
متن کاملA Parallel Hierarchical Algorithm for Module Placement Based on Sparse Linear Equations
We present a fast and eeective module placement algorithm which is based on the PROUD algorithm. The PROUD algorithm uses a hierarchical decomposition technique and the solution of sparse linear systems of equations based on a resistive network analogy. It has been shown that the PROUD algorithm is suitable for solving the placement problem for very large circuits , and obtains placement qualit...
متن کاملA PARALLEL HIERARCHICAL ALGORITHM FOR MODULE PLACEMENT BASED ON SPARSE LINEAR EQUATIONS - Circuits and Systems, 1996., ISCAS '96, 'Connecting the World'., 1996 IEEE International Symposium
We present a fast and effective module placement algorithm which is based on the PROUD algorithm. The PROUD algorithm uses a hierarchical decomposition technique and the solution of sparse linear systems of equations based on a resistive network analogy. It has been shown that the PROUD algorithm is suitable for solving the placement problem for very large circuits, and obtains placement qualit...
متن کاملInterval Analysis of Controllable Workspace for Cable Robots
Workspace analysis is one of the most important issues in the robotic parallel manipulator design. However, the unidirectional constraint imposed by cables causes this analysis more challenging in the cabledriven redundant parallel manipulators. Controllable workspace is one of the general workspace in the cabledriven redundant parallel manipulators due to the dependency on geometry parameter...
متن کاملKinematic and Dynamic Analysis of Tripteron, an Over-constrained 3-DOF Translational Parallel Manipulator, Through Newton-Euler Approach
In this research, as the main contribution, a comprehensive study is carried out on the mathematical modeling and analysis of the inverse kinematics and dynamics of an over-constraint three translational degree-of-freedom parallel manipulator. Due to the inconsistency between the number of equations and unknowns, the problem of obtaining the constraint forces and torques of an over-constraint m...
متن کامل